Covariance-engaged Classification of Sets via Linear Programming

نویسندگان

چکیده

Set classification aims to classify a set of observations as whole, opposed classifying individual separately. To formally understand the unfamiliar concept binary classification, we first investigate optimal decision rule under normal distribution, which utilizes empirical covariance be classified. We show that number in plays critical role bounding Bayes risk. Under this framework, further propose new methods classification. For case where only few parameters model drive difference between two classes, computationally-efficient approach parameter estimation using linear programming, leading Covariance-engaged LInear Programming (CLIPS) classifier. Its theoretical properties are investigated for both independent and various (short-range long-range dependent) time series structures among within each set. The convergence rates errors risk CLIPS classifier established having multiple leads faster rates, compared standard situation there is one observation applicable domains performs better than competitors highlighted comprehensive simulation study. Finally, illustrate usefulness proposed real image data histopathology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Dimensional Inverse Covariance Matrix Estimation via Linear Programming

This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by “sparse” matrices. Taking advantage of the connection between multivariate linear regression and entries of the inverse covariance matrix, we propose an estimating procedure that can effectively exploit such “sparsity”. The proposed method can be computed using linear pro...

متن کامل

Multiple Instance Classification via Successive Linear Programming

The multiple instance classification problem [6,2,12] is formulated using a linear or nonlinear kernel as the minimization of a linear function in a finite dimensional (noninteger) real space subject to linear and bilinear constraints. A linearization algorithm is proposed that solves a succession of fast linear programs that converges in a few iterations to a local solution. Computational resu...

متن کامل

Support vector machine classification via parameterless robust linear programming

We show that the problem of minimizing the sum of arbitrary-norm real distances to misclassified points, from a pair of parallel bounding planes of a classification problem, divided by the margin (distance) between the two bounding planes, leads to a simple parameterless linear program. This constitutes a linear support vector machine (SVM) that simultaneously minimizes empirical error of miscl...

متن کامل

Approximate Dynamic Programming via Linear Programming

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...

متن کامل

Index coding via linear programming

Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. Optimal encoding schemes and efficient heuristics were studied in various settings, alongside leading to new results for Network Coding such as improved gaps between linear and n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistica Sinica

سال: 2022

ISSN: ['1017-0405', '1996-8507']

DOI: https://doi.org/10.5705/ss.202020.0253